Fixed-parameter algorithms for the cocoloring problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Fixed-Parameter Algorithms for the Cocoloring Problem

A (k, l)-cocoloring of a graph G is a partition of the vertex set of G into at most k independent sets and at most l cliques. Given a graph G and integers k and l, the Cocoloring Problem is the problem of deciding if G has a (k, l)-cocoloring. It is known that determining the cochromatic number (the minimum k+l such that G is (k, l)-cocolorable) is NP-hard [24]. In 2011, Bravo et al. obtained a...

متن کامل

Electromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem

In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...

متن کامل

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem

The original version of this paper was published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006. This is an extended version published on February 20, 2006. We discuss and compare four fixed parameter algorithms for finding the minimum weight triangulation of a simple polygon with (n− k) vertices on the perimeter and k vertice...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

electromagnetism-like algorithms for the fuzzy fixed charge transportation problem

in this paper, we consider the fuzzy fixed-charge transportation problem (ffctp). both of fixed and transportation cost are fuzzy numbers. contrary to previous works, electromagnetism-like algorithms (em) is firstly proposed in this research area to solve the problem. three types of em; original em, revised em, and hybrid em are firstly employed for the given problem. the latter is being firstl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2014

ISSN: 0166-218X

DOI: 10.1016/j.dam.2013.11.010